Localized Sensor Area Coverage with Low Communication Overhead
نویسندگان
چکیده
منابع مشابه
A Low-Overhead Localized Target Coverage Algorithm in Wireless Sensor Networks
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملSecurity with Low Communication Overhead
We consider the communication complexity of secure multiparty computations by networks of processors each with unlimited computing power. Say that an n-party protocol for a function of m bits is efficient if it uses a constant number of rounds of communication and a total number of message bits that is polynomial in max(m, n). We show that any function has an efficient protocol that achieves (r...
متن کاملParallel test generation with low communication overhead
In this paper we present a method of parallelizing test generation for combinational logic using boolean satisjiability. We propose a dynamic search-space allocation strategy to split work between the available processors. This strategy is easy to implement with a greedy heuristic and is economical in its demand for inter-processor communication. We derive an analytical model t o predict the pe...
متن کاملLocalized Sensor Self-deployment with Coverage Guarantee in Complex Environment
In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has higher priority to be covered than a distant one. A localized sensor self-deployment algorithm, named Greedy-Rotation-Greedy (GRG) [10], has recently been proposed for constructing optimal focused coverage. This previous work as...
متن کاملLOCCS: Low overhead communication and computation subroutines
Our aim is to provide one set of eecient basic subroutines for scientiic computing which include both communications and computations. The overlap of communications and computations is done using asynchronous pipelining to minimize the overhead due to communications. With this set of routines, we provide to the user of parallel machines an easy SPMD type and eecient way of programming. The main...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Mobile Computing
سال: 2008
ISSN: 1536-1233
DOI: 10.1109/tmc.2007.70793